منابع مشابه
Les cahiers du GREYC
We define a simple transform able to map any multi-valued image into a space of patches, such that each existing image patch is mapped into a single high-dimensional point. We show that solving variational problems on this particular space is an elegant way of finding the natural patch-based counterparts of classical image processing techniques, such as the Tikhonov regularization and Lucas-Kan...
متن کاملLes Cahiers du GERAD ISSN : 0711 – 2440
Let G = (V,E,w) be a graph with vertex and edge sets V and E, respectively, and w : E → IR a function which assigns a positive weigth or length to each edge of G. G is called a realization of a finite metric space (M,d), with M = {1, ..., n} if and only if {1, ..., n} ⊆ V and d(i, j) is equal to the length of the shortest chain linking i and j in G ∀i, j = 1, ..., n. A realization G of (M,d), i...
متن کاملLes Cahiers du GERAD ISSN : 0711 – 2440
Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclusions. Various abstract criteria have been proposed in order to find interesting ones with computeraided or automated systems for conjecture-making. Beginning with the observation that famous theorems (and others) have first been conjectures...
متن کاملLes cahiers du laboratoire Leibniz Bayesian Robots Programming
We propose a new method to program robots based on Bayesian inference and learning. The capacities of this programming method are demonstrated through a succession of increasingly complex experiments. Starting from the learning of simple reactive behaviors, we present instances of behavior combinations, sensor fusion, hierarchical behavior composition, situation recognition and temporal sequenc...
متن کاملAlgorithms for the On-Line Quota Traveling Salesman Problem⋆ Cahiers du LAMSADE 216
The Quota Traveling Salesman Problem is a generalization of the well known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of the sales, minimizing the amount of time. In this paper we address the on-line version of the problem, where requests are given over time. We present algorithms for various metric spaces, and analyze their performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Critique d’art
سال: 2016
ISSN: 1246-8258,2265-9404
DOI: 10.4000/critiquedart.19401